An Hierarchic Genetic Algorithm for Computing (near)Optimal Euclidean Steiner Trees
نویسنده
چکیده
In this paper we present an heuristic for finding a near-optimal Euclidean Steiner Tree for a given set of terminal points. This is defined as the shortest length geometric construction that unites all the terminals. Our algorithm dynamically partitions the point set into multiple, separately optimized subsets. The Steiner tree for these subsets is constructed by running a highly modified genetic algorithm.
منابع مشابه
The Euclidean Steiner Tree Problem
The Euclidean Steiner tree problem is solved by finding the tree with minimal Euclidean length spanning a set of fixed vertices in the plane, while allowing for the addition of auxiliary vertices (Steiner vertices). Steiner trees are widely used to design real-world structures like highways and oil pipelines. Unfortunately, the Euclidean Steiner Tree Problem has shown to be NP-Hard, meaning the...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملOn the Construction of Optimal or Near - Optimal Rectilinear
Given a set of nodes N lying on the rst quadrant of the Euclidean Plane E 2 , the Rectilinear Minimum Steiner Arborescence (RMSA) problem is to nd a shortest-path tree of the minimum length rooted at the origin, containing all nodes in N , and composed solely of horizontal and vertical arcs oriented only from left to right or from bottom to top 1]. In this paper, we propose an eecient algorithm...
متن کاملComputing Steiner minimal trees in Euclidean d-space
In this paper, we propose modifications on Smith’s branch-and-bound (B&B) algorithm for the Euclidean Steiner problem in R. At each node of the B&B tree, we solve a convex programming problem in conic form to obtain a lower bound on the minimal Steiner tree length for a given topology. We also use conic formulation to obtain bounds on the child problems at a given node, that are applied on a st...
متن کاملAn improved algorithm for computing Steiner minimal trees in Euclidean d-space
We describe improvements to Smith’s branch-and-bound (B&B) algorithm for the Euclidean Steiner problem in IR. Nodes in the B&B tree correspond to full Steiner topologies associated with a subset of the terminal nodes, and branching is accomplished by “merging” a new terminal node with each edge in the current Steiner tree. For a given topology we use a conic formulation for the problem of locat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003